Residual Finiteness and Finite Equational Bases: Undecidable Properties of Finite Algebras

نویسندگان

  • Ross Willard
  • George F. McNulty
  • Ralph McKenzie
  • Brian Davey
  • Zsolt Lengvarszky
  • Marton Nagy
  • Zoltan Szekely
  • Ralph Freese
  • Bill Lampe
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Finiteness Properties for Idempotent Residuated Structures

A class K of similar algebras is said to have the finite embeddability property (briefly, the FEP) if every finite subset of an algebra in K can be extended to a finite algebra in K, with preservation of all partial operations. If a finitely axiomatized variety or quasivariety of finite type has the FEP, then its universal first order theory is decidable, hence its equational and quasi-equation...

متن کامل

Weak representations of relation algebras and relational bases

It is known that for all finite n ≥ 5, there are relation algebras with n-dimensional relational bases but no weak representations. We prove that conversely, there are finite weakly representable relation algebras with no n-dimensional relational bases. In symbols: neither of the classesRAn andwRRA contains the other. The main result of this paper concerns the relationship between two classes e...

متن کامل

On Equational Theories, Unification, and (Un)Decidability

We investigate the following classes of equational theories which are important in unification theory: permutative, finite, Noetherian, simple, almost collapse free, collapse free, regular, and O-free theories. We show some relationships between the particular classes and their connections to the unification hierarchy. Especially, we study conditions, under which minimal and complete sets of un...

متن کامل

A Finite Basis Theorem for Difference-term Varieties with a Finite Residual Bound

We prove that if V is a variety of algebras (i.e., an equationally axiomatizable class of algebraic structures) in a finite language, V has a difference term, and V has a finite residual bound, then V is finitely axiomatizable. This provides a common generalization of R. McKenzie’s finite basis theorem for congruence modular varieties with a finite residual bound, and R. Willard’s finite basis ...

متن کامل

Decision Problems for Equational Theories of Relation Algebras

The foundation of an algebraic theory of binary relations was laid by C. S. Peirce, building on earlier work of Boole and De Morgan. The basic universe of discourse of this theory is a collection of binary relations over some set, and the basic operations on these relations are those of forming unions, complements, relative products (i.e., compositions), and converses (i.e., inverses). There is...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997